Parallel routing in exchanged hypercubes
نویسندگان
چکیده
Parallel routing and diameter are two important issues in interconnection networks. The hypercube is one of the most popular interconnection networks for parallel systems due to its attractive properties such as low diameter and efficient parallel routing. The exchanged hypercube, which is a variant of the hypercube by removing some specific edges, remains several desirable properties of the hypercube. This paper discusses parallel routing in exchanged hypercubes and show the wide diameter of exchanged hypercubes.
منابع مشابه
The domination number of exchanged hypercubes
Exchanged hypercubes [Loh et al., IEEE Transactions on Parallel and Distributed Systems 16 (2005) 866–874] are spanning subgraphs of hypercubes with about one half of their edges but still with many desirable properties of hypercubes. Lower and upper bounds on the domination number of exchanged hypercubes are proved which in particular imply that γ(EH(2, t)) = 2 holds for any t ≥ 2. Using Hammi...
متن کاملEfficient Multicast in All-Port Wormhole-Routed Hypercubes
This paper addresses the problem of collective data distribution, speci cally multicast, in wormhole-routed hypercubes. The system model allows a processor to send and receive data in all dimensions simultaneously. New theoretical results that characterize contention among messages in wormhole-routed hypercubes are developed and used to design new multicast routing algorithms. The algorithms ar...
متن کاملFault-Tolerant Routing Based on Approximate Directed Routable Probabilities for Hypercubes
Recently, parallel processing systems have been studied very actively, and many topologies have been proposed. A hypercube is one of the most popular topologies for interconnection networks. In this paper, we propose two new fault-tolerant routing algorithms for hypercubes based on approximate directed routable probabilities. The probability represents ability of routing to any node at a specif...
متن کاملImproved Probabilistic Routing on Generalized Hypercubes
p. 1 Efficient Data Communication in Incomplete Hypercubes p. 13 Efficient Communication in the Folded Petersen Interconnection Networks p. 25 Compiling Rewriting onto SIMD and MIMD/SIMD Machines p. 37 A Compilation Technique for Varying Communication Cost NUMA Architectures p. 49 A Data Partitioning Algorithm for Distributed Memory Compilation p. 61 Towards a High Precision Massively Parallel ...
متن کاملEecient Collective Data Distribution in All-port Wormhole-routed Hypercubes
This paper addresses the problem of collective data distribution, speciically multicast, in wormhole-routed hypercubes. The system model allows a processor to send and receive data in all dimensions simultaneously. New theoretical results that characterize contention among messages in wormhole-routed hypercubes are developed and used to design new multicast routing algorithms. The algorithms ar...
متن کامل